Description: C++迷宫游戏源码，程序中，坐标点，如（1,1），在输入时不需要输括号，直接输1,1。该程序寻找的是最佳路径。该程序可以图形显示迷宫。
-C++ maze game code, the program, coordinate point, such as (1, 1), in the input don t need to lose parentheses, the direct lose 1, 1.
The program is the best route for.
The program can graph showing the maze.
Platform: |
Size: 9216 |
Author:邱明劼 |
Hits:
Description: 本文详细说明了一个超市财务管理的业务流程，分析了其数据流程，明确了数据表之间的联系，详细说明了主要的程序逻辑。并以图表的方式直观的说明，使程序易于理解。在分析财务管理的具体情况后，充分利用Visual c++面向对象的模块化和数据库Access在应用程序开发上灵活和效率高的特点，开发财务管理系统。-In this paper, a detailed description of the financial management of supermarket business processes, analysis of its data flow, clear the links between data tables, detailed description of the main program logic. And by the graph way direct-viewing explanation, make the procedure easy to understand. On the analysis of financial management of the situation, make full use of the Platform: |
Size: 7168 |
Author:王昌波 |
Hits:
Description: 这个C语言小程序旨在实现图的遍历，在其中有边界的判断，让算法实现的更加完美-C language small program designed to achieve the graph traversal, in which a judgment of the border, so the algorithm is more perfect Platform: |
Size: 2048 |
Author:诸葛周 |
Hits:
Description:
2.wps ：为作业最终的仿真结果与分析
正态分布：.cpp为由C++编写的主程序以获取仿真数据，.txt为存储仿真数据的文档，.m为由matlab根据获取的仿真数据画图的结果，其中1、2、3分别为N（0,1）、N（0,4.26）、N（-2.5,1）的情况
瑞利分布：.cpp为由C++编写的主程序以获取仿真数据，.txt为存储仿真数据的文档，.m为由matlab根据获取的仿真数据画图的结果，其中1、2、3分别为Ray（1）、Ray（0.36）、Ray（3.4）的情况
泊松分布：.cpp为由C++编写的主程序以获取仿真数据，.txt为存储仿真数据的文档，.m为由matlab根据获取的仿真数据画图的结果，其中1、2、3、4分别为Lamda（0.2）、Lamda（1）、Lamda（6）、Lamda（10）的情况
0.m为将三或四种情况画到一副图中并进行仿真结果对比的图像
-(2.wps:) for the job the final simulation results and analysis of the normal distribution:. Cpp written by C++ main program to obtain the simulation data. Txt document for storing simulation data, m grounds matlab drawing according to the simulation data obtained the results, wherein 1, 2, 3 respectively, for the N (0,1), N (0,4.26), N (-2.5,1), of Rayleigh distribution: CPP grounds C++ prepared by the main program to obtain its simulation data, txt for storage simulation data documents, the. m grounds MatLab drawing the results according to the simulation data obtained, wherein 1,2,3 respectively ray (1), ray (0.36), the case of the ray (3.4) poise the loose distribution: cpp grounds written main program C++ to get the simulation data txt simulation data is stored documents, m grounds matlab based on the results of the simulation data obtained drawing, in which 1, 2, 3, 4, respectively 0.m case of Lamda (0.2), Lamda (1), Lamda (6), Lamda (10) of the three or four painting to a graph, Platform: |
Size: 360448 |
Author:李娜 |
Hits:
Description: C++队列优化的Bellmanford最短路算法，使用C++实现的Queue improved Bellman-Ford单源最短路算法，在国内还被叫做SPFA。这个程序输入一个图，找到图中的一个点，这个点到最远点的长度最短。图使用邻接表保存。-Optimized Bellmanford C++ queue shortest path algorithm , use C++ achieve Queue improved Bellman-Ford single-source shortest path algorithm, also called domestic SPFA. This program input of a graph, to find a point in the figure, the point to the farthest point of the shortest length. Figure adjacency table holds. Platform: |
Size: 1024 |
Author:Wei |
Hits:
Description: C++队列优化的Bellmanford最短路算法（SPFA），使用C++实现的Queue improved Bellman-Ford单源最短路算法，在国内还被叫做SPFA。这个程序输入一个图，找到图中的一个点，这个点到最远点的长度最短。图使用邻接表保存。-Shortest path algorithm optimized Bellmanford C++ queue (SPFA), use the the achieve C++ Queue improved Bellman-Ford single-source shortest path algorithm, also known in the domestic SPFA. This program input on a graph, to find a point, the point to the farthest point of the length of the shortest. Figure adjacency table maintains. Platform: |
Size: 2048 |
Author:宋夏福 |
Hits:
Description: 给定一个带权有向图,图中各个顶点代表城市,有向边i ->j代表城市i到城市j的耗费，假定售货员当前在城市1，要求售货员周游完所有城市最后回到城市1，要求不得重复走过任何一个城市，问如何周游使得总耗费最小。编写程序解决该问题。设顶点v={1，2，……n}，c[i][j]表示城市i 到城市j的耗费，如果c[i][j]=100000,表示城市i到城市j没有直接的路可走。-Given a weighted directed graph, each vertex graph represent the city, there is a directed edge i -> j on behalf of city i to j-consuming, assuming a clerk in the city currently requires all city clerk finally finished traveled back city 1, required not to repeat any city came and asked how to travel so that the total cost is minimized. Write a program to solve the problem. Set of vertices v = {1,2, ...... n}, c [i] [j] represents city i to j-consuming, if c [i] [j] = 100000, said the city i to j is no direct way to go. Platform: |
Size: 8192 |
Author:skye |
Hits:
Description: 给定一个带权有向图,图中各个顶点代表城市,有向边i ->j代表城市i到城市j的耗费，假定售货员当前在城市1，要求售货员周游完所有城市最后回到城市1，要求不得重复走过任何一个城市，问如何周游使得总耗费最小。编写程序解决该问题。设顶点v={1，2，……n}，c[i][j]表示城市i 到城市j的耗费，如果c[i][j]=100000,表示城市i到城市j没有直接的路可走。-Given a weighted directed graph, each vertex graph represent the city, there is a directed edge i -> j on behalf of city i to j-consuming, assuming a clerk in the city currently requires all city clerk finally finished traveled back city 1, required not to repeat any city came and asked how to travel so that the total cost is minimized. Write a program to solve the problem. Set of vertices v = {1,2, ...... n}, c [i] [j] represents city i to j-consuming, if c [i] [j] = 100000, said the city i to j is no direct way to go. Platform: |
Size: 8192 |
Author:skye |
Hits:
Description: 算法竞赛入门经典（第二版） (算法艺术与信息学竞赛)
2014年6月第一次印刷
《算法竞赛入门经典(第二版)》是一本算法竞赛的入门与提高教材，把c/c++语言、算法和解题有机地结合在一起，淡化理论，注重学习方法和实践技巧。全书内容分为12 章，包括程序设计入门、循环结构程序设计、数组和字符串、函数和递归、c++与stl入门、数据结构基础、暴力求解法、高效算法设计、动态规划初步、数学概念与方法、图论模型与算法、高级专题等内容，覆盖了算法竞赛入门和提高所需的主要知识点，并含有大量例题和习题。书中的代码规范、简洁、易懂，不仅能帮助读者理解算法原理，还能教会读者很多实用的编程技巧；书中包含的各种开发、测试和调试技巧也是传统的语言、算法类书籍中难以见到的。
《算法竞赛入门经典(第二版)》可作为全国青少年信息学奥林匹克联赛（noip）复赛教材、全国青少年信息学奥林匹克竞赛（noi）和acm国际大学生程序设计竞赛（acm/icpc）的训练资料，也可作为it工程师与科研人员的参考用书。-Introduction to Algorithms (Second Edition) (algorithm art and informatics competition)
First printed in June 2014
Introduction to the classic algorithm (Second Edition) is an entry and improvement of teaching materials, the c/c++ language, algorithms and problem-solving organically combined together, dilute theory, focus on learning methods and practical skills. The book is divided into 12 chapters, including the introduction of program design, program design, cycle structure, function and recursive arrays and strings, c++ and STL entry, basis, method and data structure of violence efficient algorithm design, dynamic programming, preliminary mathematical concepts and methods, graph theory model and algorithm, advanced contents, main knowledge points cover the required entry and improve the competition algorithm, and contains a large number of examples and exercises. In the book, the code is simple and easy to understand, not only can help the reader understand the principle of the a Platform: |
Size: 9708544 |
Author:张甲林 |
Hits:
Description: 本实验实现邻接表表示下无向图的广度优先遍历。
程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。例如：
程序输入为：
a
b
c
d
e
f
*
0,1
0,4
1,4
1,5
2,3
2,5
3,5
-1,-1
程序的输出为：
the ALGraph is
a 4 1
b 5 4 0
c 5 3
d 5 2
e 1 0
f 3 2 1
the Breadth-First-Seacrh list:aebfdc
-In this experiment, the adjacency list shows the breadth first traversal of undirected graph.
The input of the program is the sequence of vertices and edges of the graph (the end of the vertex sequence is a symbol, and the edge sequence is-1,-1 is the end symbol). The output of the program is the adjacency list and the breadth first traversal sequence. For example:
Program input:
A
B
C
D
E
F
*
0,1
0,4
1,4
1,5
2,3
2,5
3,5
-1,-1
The output of the program is:
ALGraph is the
A 41
B 540
C 53
D 52
E 10
F 321
Breadth-First-Seacrh list:aebfdc the Platform: |
Size: 1024 |
Author:王乐 |
Hits:
Description: 由c语言编程，在window下运行，为无向图，先读入两个数据，第一个数据为点的个数，第二个数据为边的个数。此后依次输入哪两个点之前连线，即完成无向图。之后程序会输出0和1,0代表不存在哈密顿回路，1代表存在哈密顿回路(Programming by C language, run under window, for undirected graph, read two data first, the first data is the number of points, the second data is the number of edges. Then, which two points are connected in advance to complete the undirected graph. After that, the program outputs 0 and 1,0 representing the Hamiltonian loop, and 1 represents the Hamiltonian circuit) Platform: |
Size: 19456 |
Author:晓&风
|
Hits:
Description: 相平面法的画图包括解析法和等倾线法。我使用等倾线法，因为相平面法只使用最高二阶系统，故首先假设一个通用的二阶微分方程：X’’+aX’+bX^2+cX=0因为X’’=（dx’/dx）*（dx/dt）=X’*（dx’/dx）。
代入微分方程得：
X’*（dx’/dx）+ aX’+bX^2+cX=0.
因为斜率k=（dx’/dx）。设X’=y，则上式可化为：
k=-(b*x^2+c*x+a*y)/y
当输入任意一个x1，y1时，则可相应的确定（x1，y1）处的斜率k1，在x1加derta（程序中设定为0.001）确定x2，x2与斜率k所成直线的交点即为y2，则可相应确定k2（如图一）。以此类推，即可以斜率所成的小线段逼近相平面图。
假设输入微分方程为：X’’+X=0(The drawing of phase plane method includes analytic method and equal inclination line method. I use the isocline method, because the phase plane method uses only the highest two order system, so the first assumption of a general two order differential equation: X '' +aX '' +bX^2+cX=0 X 'because = (DX' /dx) * (dx/dt) * =X '(DX' /dx).
By substituting differential equations:
X '* (DX' /dx) + aX '+bX^2+cX=0.
Because the slope is k= (DX '/dx). If X '=y is set, then the upper form can be reduced to..:
K=- (b*x^2+c*x+a*y) /y
When the input to any x1, Y1, can be determined (x1, Y1) at the slope of K1, in X1 and derta (program set to 0.001) to determine the X2, X2 and K to the line of intersection of the slope is Y2, it can determine the corresponding K2 (Figure 1). And so on, that is, the small line segment can be approximated by the slope of the phase plane graph.
Suppose the input differential equation is: X '' +X=0) Platform: |
Size: 1024 |
Author:forevermorning
|
Hits:
Search - graph in c program